Gaussian Mixture Optimization Based on Efficient Cross-Validation
نویسندگان
چکیده
منابع مشابه
Gaussian mixture optimization for HMM based on efficient cross-validation
A Gaussian mixture optimization method is explored using cross-validation likelihood as an objective function instead of the conventional training set likelihood. The optimization is based on reducing the number of mixture components by selecting and merging a pair of Gaussians step by step base on the objective function so as to remove redundant components and improve the generality of the mod...
متن کاملAggregated cross-validation and its efficient application to Gaussian mixture optimization
We have previously proposed a cross-validation (CV) based Gaussian mixture optimization method that efficiently optimizes the model structure based on CV likelihood. In this study, we propose aggregated cross-validation (AgCV) that introduces a bagging-like approach in the CV framework to reinforce the model selection ability. While a single model is used in CV to evaluate a held-out subset, Ag...
متن کاملSurrogating the surrogate: accelerating Gaussian-process-based global optimization with a mixture cross-entropy algorithm
In global optimization, when the evaluation of the target function is costly, the usual strategy is to learn a surrogate model for the target function and replace the initial optimization by the optimization of the model. Gaussian processes have been widely used since they provide an elegant way to model the fitness and to deal with the explorationexploitation trade-off in a principled way. Sev...
متن کاملEigenvoice conversion based on Gaussian mixture model
This paper describes a novel framework of voice conversion (VC). We call it eigenvoice conversion (EVC). We apply EVC to the conversion from a source speaker’s voice to arbitrary target speakers’ voices. Using multiple parallel data sets consisting of utterancepairs of the source and multiple pre-stored target speakers, a canonical eigenvoice GMM (EV-GMM) is trained in advance. That conversion ...
متن کاملEfficient Greedy Learning of Gaussian Mixture Models
This article concerns the greedy learning of gaussian mixtures. In the greedy approach, mixture components are inserted into the mixture one after the other. We propose a heuristic for searching for the optimal component to insert. In a randomized manner, a set of candidate new components is generated. For each of these candidates, we find the locally optimal new component and insert it into th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing
سال: 2010
ISSN: 1932-4553,1941-0484
DOI: 10.1109/jstsp.2010.2048235